Constraint Satisfaction with Counting Quantifiers
نویسندگان
چکیده
منابع مشابه
Constraint Satisfaction with Counting Quantifiers
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers ∃ which assert the existence of at least j elements such that the ensuing property holds. These are natural variants of CSPs in the mould of quantified CSPs (QCSPs). Namely, ∃ := ∃ and ∃ := ∀ (for the domain of size n) We observe that a single counting quantifier ∃ strictly between ∃ and ∀ a...
متن کاملConstraint Satisfaction with Counting Quantifiers 2
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers ∃≥j, asserting the existence of j distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper [11], we focus on the complexity of undirected graph templates. As our main contribution, we settle the two principal open questions proposed in [11]. Firstly, we complete th...
متن کاملConstraint satisfaction using soft quantifiers
Ronald R. Yager Machine Intelligence Institute, Iona College New Rochelle, NY 10801 [email protected] (212)249-2047 ABSTRACT Fuzzy sets and other methods have been used to model a softening of constraints in CP problems. Here we suggest an approach to the softening of the CP problem at the meta level, the process used to aggregate the satisfactions to the individual constraints. We suggest the us...
متن کاملCounting Constraint Satisfaction Problems
This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and open problems. It does not cover holants, which are the subject of a separate chapter. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorith...
متن کاملGalois correspondence for counting quantifiers
We introduce a new type of closure operator on the set of relations, max-implementation, and its weaker analog max-quantification. Then we show that approximation preserving reductions between counting constraint satisfaction problems (#CSPs) are preserved by these two types of closure operators. Together with some previous results this means that the approximation complexity of counting CSPs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140981332